一类带有三维核的多点边值问题解的存在性(英文)

In this paper,a multi-point boundary value problems for a three order nonlinear deferential equation is considered.With the help of coincidence theorem due to Mawhin,a existence theorem is obtained.     

SOLVABILITY FOR FRACTIONAL-ORDER TWO-POINT BOUNDARY VALUE PROBLEM AT RESONANCE

In this paper, we are concerned with the existence of solution to a boundary value problem of nonlinear fractional differential equation at resonance. By means of the coincidence degree theory, the existence of solution is obtained.     

EXISTENCE OF POSITIVE PERIODIC SOLUTIONS TO A DISCRETE TIME NON-AUTONOMOUS COMPETING SYSTEM WITH FEEDBACK CONTROLS

In this paper,a class of discrete time non-autonomous competing system with feedback controls is considered. With the help of differential equations with piecewise constant arguments,we first propose a discrete model of a continuous non-autonomous competing system with feedback controls. Then,using the coincidence degree and the related continuation theorem as well as some priori estimations,a suficient condition for the existence of positive solutions to difference equations is obtained.     

平面图线性色数的一个上界

如果图G的一个正常染色满足染任意两种颜色的顶点集合导出的子图是一些点不交的路的并,则称这个正常染色为图G的线性染色．图G的线性色数用lc（G）表示,是指G的所有线性染色中所用的最少颜色的个数．证明了：若G是一个最大度△（G）≠5,6的平面图,则lc（G）≤2△（G）．     

Hypergraph list coloring and Euclidean Ramsey theory

A hypergraph is simple if it has no two edges sharing more than a single vertex. It is s‐list colorable (or s‐choosable) if for any assignment of a list of s colors to each of its vertices, there is a vertex coloring assigning to each vertex a color from its list, so that no edge is monochromatic. We prove that for every positive integer r, there is a function d_r(s) such that no r‐uniform simple hypergraph with average degree at least d_r(s) is s‐list‐colorable. This extends a similar result for graphs, due to the first author, but does not give as good estimates of d_r(s) as are known for d₂(s), since our proof only shows that for each fixed r ≥ 2, d_r(s) ≤ 2 We use the result to prove that for any finite set of points X in the plane, and for any finite integer s, one can assign a list of s distinct colors to each point of the plane so that any coloring of the plane that colors each point by a color from its list contains a monochromatic isometric copy of X. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

Improving Physical Properties via C?H Oxidation: Chemical and Enzymatic Approaches

Physicochemical properties constitute a key factor for the success of a drug candidate. Whereas many strategies to improve the physicochemical properties of small heterocycle‐type leads exist, complex hydrocarbon skeletons are more challenging to derivatize because of the absence of functional groups. A variety of C H oxidation methods have been explored on the betulin skeleton to improve the solubility of this very bioactive, yet poorly water‐soluble, natural product. Capitalizing on the innate reactivity of the molecule, as well as the few molecular handles present on the core, allowed oxidations at different positions across the pentacyclic structure. Enzymatic oxidations afforded several orthogonal oxidations to chemical methods. Solubility measurements showed an enhancement for many of the synthesized compounds.     

利他偏好下供应链效率和公平度动态演进研究

根据零售商利他偏好信息非对称性和动态演进特征,将零供博弈信息结构分为4个演进过程,采用逆向归纳法求解各个过程中供应链主观效率和客观效率、以"公平熵"计算供应链主观公平度和客观公平度,从主观与客观2个维度分析供应链利他偏好行为对供应链效率和公平度动态演进的影响.通过对比分析得出:信息对称下零售商利他偏好行为不改变供应链利润但会改变各个成员在供应链中的利润分配比例,起到"供应链利润分配机制"的作用;供应链主观效率总是不低于客观效率,供应链主观公平度总是不低于客观公平度;从主观评价供应链能够实现协调且供应链能够兼顾效率和公平.     

Asymmetry and structural information in preferential attachment graphs

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd?s‐Rényi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with m edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for m = 1, and there is some nonnegligible probability of symmetry for m = 2. It was conjectured that these graphs are asymmetric when m ≥ 3. We settle this conjecture in the affirmative, then use it to estimate the structural entropy of the model. To do this, we also give bounds on the number of ways that the given graph structure could have arisen by preferential attachment. These results have further implications for information theoretic problems of interest on preferential attachment graphs.     

Rainbow matchings in Dirac bipartite graphs

We show the existence of rainbow perfect matchings in μn‐bounded edge colorings of Dirac bipartite graphs, for a sufficiently small μ > 0. As an application of our results, we obtain several results on the existence of rainbow k‐factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree.     

A strengthened Barvinok-Pataki bound on SDP rank

The Barvinok-Pataki bound provides an upper bound on the rank of extreme points of a spectrahedron. This bound depends solely on the number of affine constraints of the problem, i.e., on the algebra of the problem. Specifically, the triangular number of the rank r is upper bounded by the number of affine constraints. We revisit this bound and provide a strengthened upper bound on the rank using the singularity degree of the spectrahedron. Thus we bring in the geometry and stability of the spectrahedron, i.e., increased instability as seen by higher singularity degree, yields a lower, strengthened rank bound.